A Mass Formula for Steiner Triple Systems STS(2n−1) of 2-Rank 2n−n

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On 2-ranks of Steiner triple systems

Our main result is an existence and uniqueness theorem for Steiner triple systems which associates to every such system a binary code | called the \carrier" | which depends only on the order of the system and its 2-rank. When the Steiner triple system is of 2-rank less than the number of points of the system, the carrier organizes all the information necessary to construct directly all systems ...

متن کامل

Biembeddings of 2-Rotational Steiner Triple Systems

It is shown that for v ≡ 1 or 3 (mod 6), every pair of Heffter difference sets modulo v gives rise to a biembedding of two 2-rotational Steiner triple systems of order 2v + 1 in a nonorientable surface. AMS classification: 05C10.

متن کامل

A Markov chain for Steiner triple systems

These notes describe what might be a Markov chain method for choosing a random Steiner triple system. Many things are not known, including whether or not the Markov chain is connected! I include a positive result of Grannell and Griggs according to which any two isomorphic Steiner triple systems lie in the same connected component. 1 Choosing at random Suppose I have a fair coin. How can I choo...

متن کامل

Bicoloring Steiner Triple Systems

A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the color classes. In this paper we give necessary conditions for the existence of a bicoloring with 3 color classes and give a multiplication theorem for Steiner triple systems with 3 color classes. We also examine bicolo...

متن کامل

Balanced Steiner Triple Systems

A Steiner triple system of order v (briefly STS(v)) is a pair (X, B), where X is a v-element set and B is a collection of 3-subsets of X (triples), such that every pair of X is contained in exactly one triple of B. It is well known that a necessary and sufficient condition for a STS(v) to exist is that v#1 or 3 (mod 6). An r-coloring of a STS(v) is a map , : X [1, ..., r] such that at least two...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2001

ISSN: 0097-3165

DOI: 10.1006/jcta.2000.3161